Infinite-Dimensional Fisher Markets and Tractable Fair Division
نویسندگان
چکیده
Fisher market equilibrium models have long been a central topic in economics and computation. Recently, they widely used the design implementation of Internet marketplaces. Although classical are well studied can be solved via tractable optimization characterizations, only allow finite number items thus face scalability issues when item space is huge or even continuous. In “Infinite-Dimensional Markets Tractable Fair Division,” Gao Kroer propose infinite-dimensional convex programs show that capture equilibria for infinite possibly continuous spaces, extending Eisenberg-Gale framework. Using these results, authors challenging cake-cutting problem piecewise linear agent valuations equivalent to finding admits characterization. Thus, it polynomial time theory highly efficiently by numerical software.
منابع مشابه
infinite dimensional garch models
مدلهای گارچ در فضاهای هیلبرت پایان نامه حاضر شامل دو بخش می باشد. در قسمت اول مدلهای اتورگرسیو تعمیم یافته مشروط به ناهمگنی واریانس در فضاهای هیلبرت را معرفی، مفاهیم ریاضی مورد نیاز در تحلیل این مدلها در دامنه زمان را مطرح کرده و آنها را مورد بررسی قرار می دهیم. بر اساس پیشرفتهایی که اخیرا در زمینه تئوری داده های تابعی و آماره های عملگری ایجاد شده است، فرآیندهایی که دارای مقادیر در فضاهای ...
15 صفحه اولFair Division*
Properties of discrete cake-cutting procedures that use a minimal number of cuts (n – 1 if there are n players) are analyzed. None is always envy-free or efficient, but divideand-conquer (D&C) minimizes the maximum number of players that any single player may envy. It works by asking n ≥ 2 players successively to place marks on a cake that divide it into equal or approximately equal halves, the...
متن کاملFair Division and Redistricting
Recently, Landau, Oneil, and Yershov provided a novel solution to the problem of redistricting. Instead of trying to ensure fairness by assigning the power to draw the map to nonbiased entities, the solution ensures fairness by balancing competing interests against each other. This kind of solution is an example of what are known as “fair division” solutions— such solutions account explicitly f...
متن کاملFisher Markets and Convex Programs
Convex programming duality is usually stated in its most general form, with convex objective functions and convex constraints. (The book by Boyd and Vandenberghe is an excellent reference [2].) At this level of generality the process of constructing a dual of a convex program is not so simple, in contrast to LP duality where there is a simple set of rules one can use for the same purpose. In th...
متن کاملA Fair Infinite Lottery
An infinity of gods collectively select a random natural number by each removing a finite number of balls from an urn in a reverse supertask. It is discussed whether this is an absurdity that indicates the impossibility of reverse supertasks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2023
ISSN: ['1526-5463', '0030-364X']
DOI: https://doi.org/10.1287/opre.2022.2344